On the limitations of fractal image texture coding
نویسندگان
چکیده
Fractal-based image coders suuer from perceptually annoying distortion in textured areas. This paper discusses possible reasons for this limitation. A texture may be modelled as a stochastic process with place-independent autocorrelation properties. Two image areas should have similar correlation (spectral) properties to be perceived as belonging to the same texture. We show that stationary textures in the general case do not possess the self-similarity property on which current block-based fractal coding methods are based. A fractal collage approximation of such a texture may possess quite diierent spectral properties than is the case for the texture itself. We derive a formula for the transformed correlation function introduced by the decima-tion in the collage modelling process for the one-dimensional case, and provide coding examples and comparisons to JPEG for practical texture images. Areas with diierent spectral content, elsewhere in the same image, are needed in order to obtain an approximation with the desired spectral properties for a given texture area. The probability for this speciic kind of image nonstationarity to be present may be rather small, which may explain why fractal texture coding often yields perceptually unsatisfying results, even with extensive domain searching.
منابع مشابه
Comparison of Wavelet Transforms and Fractal Coding in Texture-Based Image Retrieval
Image compression techniques based on wavelet and fractal coding have been recognized signiicantly useful in image texture classiication and discrimination. In fractal coding approach, each image is represented by a set of self-transformations through which an approximation of the original image can be reconstructed. These transformations of images can be utilized to distinguish images. The fra...
متن کاملDeferring range/domain comparisons in fractal image compression
Fractals are a promising framework for several applications other than image coding and trasmission, such as database indexing, texture mapping and pattern recognition problems such as writer authentication. However, fractal based algorithms are strongly asymmetric because, in spite of the linearity of the decoding phase, the coding process is very time consuming. Many different solutions have ...
متن کاملImplicit Image Models in Fractal Image Compression
Why does fractal image compression work? What properties must an image have for fractal block coders to work well? What is the implicit image model underlying fractal image compression? The behavior of fractal block coders is clear for deterministically self-similar structures. In this paper we examine the behavior of these coders on statistically self-similar structures. Speci cally, we examin...
متن کاملMEDICAL IMAGE COMPRESSION: A REVIEW
Within recent years the use of medical images for diagnosis purposes has become necessity. The limitation in transmission and storage space also growing size of medical images has necessitated the need for efficient method, then image Compression is required as an efficient way to reduces irrelevant and redundancy of the image data in order to be able to store or transmits data. It also reduces...
متن کاملImproving security of double random phase encoding with chaos theory using fractal images
This study presents a new method based on the combination of cryptography and information hiding methods. Firstly, the image is encoded by the Double Random Phase Encoding (DRPE) technique. The real and imaginary parts of the encoded image are subsequently embedded into an enlarged normalized host image. DRPE demands two random phase mask keys to decode the decrypted image at the destination. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996